Sharp error bounds for turning point expansions
نویسندگان
چکیده
Financial support from Ministerio de Ciencia e Innovacion Spain, project PGC2018-098279-B-I00 (MCIU/AEI/FEDER, UE) is acknowledged.
منابع مشابه
Sharp Error Bounds for Jacobi Expansions and Gegenbauer-Gauss Quadrature of Analytic Functions
This paper provides a rigorous and delicate analysis for exponential decay of Jacobi polynomial expansions of analytic functions associated with the Bernstein ellipse. Using an argument that can recover the best estimate for the Chebyshev expansion, we derive various new and sharp bounds of the expansion coefficients, which are featured with explicit dependence of all related parameters and val...
متن کاملSharp Generalization Error Bounds for Randomly-projected Classifiers
We derive sharp bounds on the generalization error of a generic linear classifier trained by empirical risk minimization on randomlyprojected data. We make no restrictive assumptions (such as sparsity or separability) on the data: Instead we use the fact that, in a classification setting, the question of interest is really ‘what is the effect of random projection on the predicted class labels?’...
متن کاملParabolic Cylinder Functions:Examples of Error Bounds For Asymptotic Expansions
Several asymptotic expansions of parabolic cylinder functions are discussed and error bounds for remainders in the expansions are presented. In particular Poincaré-type expansions for large values of the argument z and uniform expansions for large values of the parameter are considered. The expansions are based on those given in [5] and on modifications of these expansions given in [9]. Compute...
متن کاملSharp Bounds on the PI Spectral Radius
In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.
متن کاملSharp error bounds on quantum Boolean summation in various settings
We study the quantum summation (QS) algorithm of Brassard, Høyer, Mosca and Tapp, see [1], that approximates the arithmetic mean of a Boolean function defined on N elements. We improve error bounds presented in [1] in the worst-probabilistic setting, and present new error bounds in the average-probabilistic setting. In particular, in the worst-probabilistic setting, we prove that the error of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Classical Analysis
سال: 2021
ISSN: ['1848-5979', '1848-5987']
DOI: https://doi.org/10.7153/jca-2021-18-05